Distributed protocols for access arbitration in tree-structured communication channels
نویسندگان
چکیده
منابع مشابه
Distributed protocols for access arbitration in tree-structured communication channels
We consider the problem of arbitrating access to a tree stn~ctured communication channel with large geographic extent, providing multipoint communication among a set of terminals. In our model. terminals transmit information in bursts consisting of many packets and compete for the right to transmit bursts. In the simplest case, the channel allows only one terminal to transmit at a time; this ca...
متن کاملProtocols for Asymmetric Communication Channels
1 This research was conducted in part while Micah Adler was at the Computer Science Department of the University of Toronto (supported by an operating grant from the Natural Sciences and Engineering Research Council of Canada, and by ITRC, an Ontario Centre of Excellence), and in part while he was at the Heinz Nixdorf Institute Graduate College, Paderborn, Germany. Department of Computer Scienc...
متن کاملPrecise Data Access on Distributed Log-Structured Merge-Tree
Log-structured merge tree decomposes a large database into multiple parts: an in-writing part and several read-only ones. It achieves high write throughput as well as low read latency. However, read requests have to go through multiple structures to find the required data. In a distributed database system, different parts of the LSM-tree are stored distributedly. Data access issues extra networ...
متن کاملStructured Design of Communication Protocols *
We propose a compositional technique to design multifunction protocols. The technique involves rst designing the protocols performing the various functions separately and then combining them using a set of constraints. The constraints are used to specify the interactions between the component protocols. The interactions, for example, specify when a function has to be performed and whether two f...
متن کاملCompressing Communication in Distributed Protocols
We show how to compress communication in distributed protocols in which parties do not have private inputs. More specifically, we present a generic method for converting any protocol in which parties do not have private inputs, into another protocol where each message is “short” while preserving the same number of rounds, the same communication pattern, the same output distribution, and the sam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 1991
ISSN: 0090-6778
DOI: 10.1109/26.79284